A Pattern Language for Topology Aware Mapping
نویسندگان
چکیده
Obtaining the best performance from a parallel program involves four important steps: 1. Choice of the appropriate grainsize; 2. Balancing computational and communication load across processors; 3. Optimizing communication by minimizing interprocessor communication and overlap of communication with computation; and 4. Minimizing communication traffic on the network by topology aware mapping. In this paper, we will present a pattern language for the fourth step where we deploy topology aware mapping to minimize communication traffic on the network and optimize performance. Bandwidth occupancy of network links by different messages at the same time leads to contention which increases message latencies. Topology aware mapping of communicating tasks on the physical processors can avoid this and improve application performance significantly.
منابع مشابه
TAC: A Topology-Aware Chord-based Peer-to-Peer Network
Among structured Peer-to-Peer systems, Chord has a general popularity due to its salient features like simplicity, high scalability, small path length with respect to network size, and flexibility on node join and departure. However, Chord doesn’t take into account the topology of underlying physical network when a new node is being added to the system, thus resulting in high routing late...
متن کاملTopology coloring
The purpose of this study is to show how topological surfaces are painted in such a way that the colors are borderless but spaced with the lowest color number. That a surface can be painted with at least as many colors as the condition of defining a type of mapping with the condition that it has no fixed point. This mapping is called color mapping and is examined and analyzed in differe...
متن کاملOn invariant sets topology
In this paper, we introduce and study a new topology related to a self mapping on a nonempty set.Let X be a nonempty set and let f be a self mapping on X. Then the set of all invariant subsets ofX related to f, i.e. f := fA X : f(A) Ag P(X) is a topology on X. Among other things,we nd the smallest open sets contains a point x 2 X. Moreover, we find the relations between fand To f . For insta...
متن کاملA Case Study of Communication Optimizations on 3D Mesh Interconnects
Optimal network performance is critical to efficient parallel scaling for communication-bound applications on large machines. With wormhole routing, no-load latencies do not increase significantly with number of hops traveled. Yet, we, and others have recently shown that in presence of contention, message latencies can grow substantially large. Hence task mapping strategies should take the topo...
متن کاملCHARACTERIZATIONS OF (L;M)-FUZZY TOPOLOGY DEGREES
In this paper, characterizations of the degree to which a mapping $mathcal{T} : L^{X}longrightarrow M$ is an $(L, M)$-fuzzy topology are studied in detail.What is more, the degree to which an $L$-subset is an $L$-open set with respect to $mathcal{T}$ is introduced.Based on that, the degrees to which a mapping $f: Xlongrightarrow Y$ is continuous,open, closed or a quotient mapping with respect t...
متن کامل